Iterative Sparse Asymptotic Minimum Variance Based Approaches for Array Processing
نویسندگان
چکیده
منابع مشابه
Asymptotic algorithm for computing the sample variance of interval data
The problem of the sample variance computation for epistemic inter-val-valued data is, in general, NP-hard. Therefore, known efficient algorithms for computing variance require strong restrictions on admissible intervals like the no-subset property or heavy limitations on the number of possible intersections between intervals. A new asymptotic algorithm for computing the upper bound of the samp...
متن کاملBayesian Approaches for Robust Array Signal Processing
Modern techniques for sensor array signal processing are hampered by the often un realistic and overly simplistic assumptions used in their development Foremost among these assumptions are those relating to the array geometry or response including for example known sensor positions availability of complete gain phase mutual coupling calibration data uniform linear arrays etc Of course with real...
متن کاملMinimum Variance Adaptive Beamforming Applied to a Circular Sonar Array
The minimum variance (MV) beamformer, also known as the Capon or minimum variance distortionless response (MVDR) beamformer, uses the recorded wavefield to compute a set of optimal weights to be applied to each sensor, before coherently adding the sensor outputs. The weights are chosen such that the variance of the output is minimized while maintaining unit gain in the view direction. The MV be...
متن کاملAsymptotic enumeration of sparse graphs with a minimum degree constraint
We derive an asymptotic formula for the number of graphs with n vertices all of degree at least k, and m edges, with k fixed. This is done by summing the asymptotic formula for the number of graphs with a given degree sequence, all degrees at least k. This approach requires analysis of a set of independent truncated Poisson variables, which approximate the degree sequence of a random graph chos...
متن کاملSparse representations and sphere decoding for array signal processing
a r t i c l e i n f o a b s t r a c t Array processing algorithms are used in many applications for source localization and signal waveform estimation. When the number of snapshots is small and/or the signal-to-noise ratio (SNR) is low, it becomes a challenge to discriminate closely-spaced sources. In this paper, two new array processing algorithms exploiting sparsity are proposed to overcome t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2013
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2012.2231676